graph coloring meaning in Chinese
图色
图着色
Examples
- A min - conflict weight - learning algorithm for graph coloring problem
图着色问题的一个最小冲突权值学习算法 - In this paper , four types of graph coloring are discussed : dynamic coloring , incidence coloring , entire coloring and edge - face coloring of planar graphs
本文讨论了若干图类的四种不同的着色问题：动态着色、关联着色、平面图的完备着色和边面着色。 - By virtue of associating and improving the graph coloring algorithm and maximal matching algorithm , a coloring - matching algorithm is proposed to solve the exam - arrangement problem
摘要将安排考试课程与分配班级考场分别化为图的染色与最大匹配问题，进而将两种算法融合并改进，使之适合于实际应用。 - In the second part , this paper does deeply research on how to use the memory system effectively . firstly , this paper proposes a modified register allocation via graph coloring to alleviate port conflicts
然后,面对分体寄存器文件可能产生端口冲突的新问题,提出了改进的基于图着色的寄存器分配法。 - Based on the combination of graph coloring model and the concept of spectrum quality grading , the proposed algorithm allocated the available spectrum to cognitive radio cells to meet demand maximally under qos guarantee
使用图论着色模型，结合频谱质量分级概念，根据小区内需求情况，该算法将网络中周期检测到的可用频谱分配给各个认知小区，最大化满足需求的同时，为业务提供服务质量保障。